On Sub Convexlike Optimization Problems
نویسندگان
چکیده
In this paper, we show that the sub convexlikeness and subconvexlikeness defined by V. Jeyakumar are equivalent in locally convex topological spaces. We also deal with set-valued vector optimization problems obtained saddle-point theorems Lagrangian theorems.
منابع مشابه
Sub-Dividing Genetic Method for Optimization Problems
Nowadays, optimization problem have more application in all major but they have problem in computation. Computation global point in continuous functions have high calculation and this became clearer in large space .In this paper, we proposed SubDividing Genetic Method(SGM) that have less computation than other method for achieving global points . This method userotation mutation and crossover b...
متن کاملSub-transmission sub-station expansion planning based on bacterial foraging optimization algorithm
In recent years, significant research efforts have been devoted to the optimal planning of power systems. Substation Expansion Planning (SEP) as a sub-system of power system planning consists of finding the most economical solution with the optimal location and size of future substations and/or feeders to meet the future load demand. The large number of design variables and combination of discr...
متن کاملOn Budgeted Optimization Problems
In this paper we give a general method to solve budgeted optimization problems in strongly polynomial time. The method can be applied to several known budgeted problems and in addition we show two new applications. The first one extends Frederickson’s and Solis-Oba’s result [10] to (poly)matroid intersections from single matroids. The second one is the budgeted version of the minimum cost circu...
متن کاملStrict Efficiency in Vector Optimization with Nearly Convexlike Set-Valued Maps
and Applied Analysis 3 (3) Δ S (y) < 0 for every y ∈ intA, Δ S (y) = 0 for every y ∈ ∂A, and Δ S (y) > 0 for every y ∈ int S; (4) if S is closed, then it holds that S = {y : Δ S (y) ≤ 0}; (5) if S is a convex, then Δ S is convex; (6) if S is a cone, then Δ S is positively homogeneous; (7) if S is a closed convex cone, then Δ S is nonincreasing with respect to the ordering relation induced on Y....
متن کاملA note on symmetric duality in vector optimization problems
In this paper, we establish weak and strong duality theorems for a pair of multiobjective symmetric dual problems. This removes several omissions in the paper "Symmetric and self duality in vector optimization problem, Applied Mathematics and Computation 183 (2006) 1121-1126".
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11132928